Path-sensitive bug detection analysis of C# program illustrated by null pointer dereference
نویسندگان
چکیده
منابع مشابه
Field-sensitive pointer analysis for C
The subject of this paper is flowand context-insensitive pointer analysis. We present, for the first time, a fieldsensitive constraint-based analysis for C and evaluate its effects on time and precision. In addition, we study in detail four solving algorithms, including the Heintze-Tardieu solver, over 7 common C programs ranging in size from 5000 to 150,000 lines of code. Our results indicate ...
متن کاملSPAS: Scalable Path-Sensitive Pointer Analysis on Full-Sparse SSA
We present a new SPAS (ScalablePAth-Sensitive)framework for resolving points-to sets in C programs that exploits recent advances in pointer analysis. SPAS enables intraprocedural path-sensitivity to be obtained in flow-sensitive and context-sensitive (FSCS) techniques scalably, by using BDDs to manipulate program paths and by performing pointer analysis level-by-level on a full-sparse SSA repre...
متن کاملAutomatic Bug Detection in Microcontroller Software by Static Program Analysis
Microcontroller software typically consists of a few hundred lines of code only, but it is rather different from standard application code. The software is highly hardware and platform specific, and bugs are often a consequence of neglecting subtle specifications of the microcontroller architecture. Currently, there are hardly any tools for analyzing such software automatically. In this paper, ...
متن کاملDetecting Null-dereference Bugs via a Backward Analysis
Null dereference is a common occurring bug in programming languages such as C. In this paper, we propose a path-sensitive and context-sensitive approach that performs a backward dataflow analysis to identify nulldereference bugs. One novel feature of our approach is that with the help of aliasing predicates, it can perform strong updates in presence of aliasing, thus eliminating false positives...
متن کاملPath Sensitive Program Analysis Using Boolean Satisfiability
Recent advances in boolean satisfiability (SAT) solvers have made it possible to solve structured formulas on the order of a million variables. In this work we show how to efficiently transform program analysis problems directly into SAT instances. The translation is similar to generating verification conditions, but we avoid exponential growth by introducing temporary variables in place of usi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of RAS
سال: 2015
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2015-27(5)-5